An algorithm of semi-Delaunay triangulation of points cloud scattered on surface
نویسنده
چکیده
The purpose of this paper is to generalize the Delaunay[13] triangulation onto surfaces. A formal definition and an appropriate algorithm are presented. Starting from a plane domain Delaunay triangulation definition, a theoretical approach is evolved (which is a background for further considerations). It has been proven that, in the case of a plane surface, the introduced Delaunay triangulation of surfaces is identical to classical Delaunay triangulation of the plane domain. The proposed algorithm is implemented. and numerical results are shown.
منابع مشابه
Triangulating Point Clouds with Spherical Topology
Triangulating a set of scattered 3D points is a common approach to surface reconstruction from unorganized point clouds. Besides several Voronoi-based and incremental algorithms, a recently presented technique parameterizes the sample points and uses a Delaunay triangulation of the parameter points in the parameter domain. This method is limited to reconstructing surfaces that are homeomorphic ...
متن کاملReview on Surface Reconstruction Algorithms
Surface reconstruction is to find a surface from a given finite set of geometric sample value. Surface reconstructing 3D surfaces from point samples is a well studied problem in computer graphics. All algorithms, aim to solve this problem must overcome several difficulties. One of which is related to the size and quality of the input, under sampling, and noise. The main aim of this research pap...
متن کاملA Surface Reconstruction Algorithm Based on 3 D Point Cloud Stratified
This paper presents a novel surface reconstruction algorithm based on 3D point cloud sliced by a series of planes vertical to Z-axis. First, the density and distribution of point cloud is analyzed in vertical direction Z-axis and a stratified point cloud model is put forward to present an object feature, in which point cloud is sliced with irregular intervals. An approach of stratified point cl...
متن کاملVolumetric snapping: Watertight triangulation of point clouds
We propose an algorithm which constructs an interpolating triangular mesh from a closed point cloud of arbitrary genus. The algorithm first constructs an intermediate structure called a Delaunay cover, which forms a barrier between the inside and the outside of the object. This structure is used to build a boolean voxel grid, with cells intersecting the cover colored black and all other cells c...
متن کاملSpécialité: Vision Pour La Robotique Acknowledgements First of All, I Would like to Thank
The automatic 3d modeling of an environment using images is still an active topic in Computer Vision. Standard methods have three steps: moving a camera in the environment to take an image sequence, reconstructing the geometry of the environment, and applying a dense stereo method to obtain a surface model of the environment. In the second step, interest points are detected and matched in image...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Science (AGH)
دوره 15 شماره
صفحات -
تاریخ انتشار 2014